Aiming at the problems of slow detection and low recognition accuracy of road traffic signs in Chinese intelligent driving assistance system, an improved road traffic sign detection algorithm based on YOLOv3 (You Only Look Once version 3) was proposed. Firstly, MobileNetv2 was introduced into YOLOv3 as the basic feature extraction network to construct an object detection network module MN-YOLOv3 (MobileNetv2-YOLOv3). And two Down-up links were added to the backbone network of MN-YOLOv3 for feature fusion, thereby reducing the model parameters, and improving the running speed of the detection module as well as information fusion performance of the multi-scale feature maps. Then, according to the shape characteristics of traffic sign objects, K-Means++ algorithm was used to generate the initial cluster center of the anchor, and the DIOU (Distance Intersection Over Union) loss function was introduced to combine DIOU and Non-Maximum Suppression (NMS) for the bounding box regression. Finally, the Region Of Interest (ROI) and the context information were unified by ROI Align and merged to enhance the object feature expression. Experimental results show that the proposed algorithm has better performance, and the mean Average Precision (mAP) of the algorithm on the dataset CSUST (ChangSha University of Science and Technology) Chinese Traffic Sign Detection Benchmark (CCTSDB) can reach 96.20%. Compared with Faster R-CNN (Region Convolutional Neural Network), YOLOv3 and Cascaded R-CNN detection algorithms, the proposed algorithm has better real-time performance, higher detection accuracy, and is more robustness to various environmental changes.
During the automatic segmentation of cardiac structures in echocardiographic sequences within a cardiac cycle, the contour with weak edges can not be extracted effectively. A new approach combining Speeded Up Robust Feature (SURF) and Chan-Vese model was proposed to resolve this problem. Firstly, the weak boundary of heart chamber in the first frame was marked manually. Then, the SURF points around the boundary were extracted to build Delaunay triangulation. The positions of weak boundaries of subsequent frames were predicted using feature points matching between adjacent frames. The coarse contour was extracted using Chan-Vese model, and the fine contour of object could be acquired by region growing algorithm. The experiment proves that the proposed algorithm can effectively extract the contour of heart chamber with weak edges, and the result is similar to that by manual segmentation.
Feature extraction is a key step of image retrieval and image registration, but the single feature can not express the information of medical images efficiently. To overcome this shortcoming, a new algorithm for medical image retrieval combining global features with local features was proposed based on the characteristics of medical images. First, after studying the medical image retrieving techniques with single feature, a new retrieval method was proposed by considering global feature and relevance feedback. Then to optimize the Scale-Invariant Feature Transform (SIFT) features, an improved SIFT features extraction and matching algorithm was proposed. Finally, in order to ensure the accuracy of the results and improve the retrieval result, local features were used for stepwise refinement. The experimental results on general Digital Radiography (DR) images prove the effectiveness of the proposed algorithm.
Irregular computing exists in large scale parallel application widely and the automatic parallelization on distributed memory is hardly to generate parallel code for irregular loops at compile-time. The communication code of the parallel code influences the correctness and the efficiency to the runout of the program. It could automatically generate useful communication code for a common class of irregular loops at compile-time by using the approach of partial communication redundancy, that needed analyzing the array redistribution graph of the program to maintain the producer-consumer relation of irregular array references. The approach searched the local definition set of the irregular array on each processor by computation decomposition and accessed expression of array references as the communication data set, then analyzed the communication strategies for such irregular loops and generated the corresponding communication code. The experimental results show the validity of the approach and the expectant speedup of test applications.